Misleading Generalized Itemset discovery
نویسندگان
چکیده
منابع مشابه
Misleading Generalized Itemset discovery
Frequent generalized itemset mining is a data mining technique utilized to discover a high-level view of interesting knowledge hidden in the analyzed data. By exploiting a taxonomy, patterns are usually extracted at any level of abstraction. However, some misleading high-level patterns could be included in the mined set. This paper proposes a novel generalized itemset type, namely theMisleading...
متن کاملBayesian Mixture Models for Frequent Itemset Discovery
In binary-transaction data-mining, traditional frequent itemset mining often produces results which are not straightforward to interpret. To overcome this problem, probability models are often used to produce more compact and conclusive results, albeit with some loss of accuracy. Bayesian statistics have been widely used in the development of probability models in machine learning in recent yea...
متن کاملAdaptation Knowledge Discovery for Cooking Using Closed Itemset Extraction
This paper is about the adaptation knowledge (AK) discovery for the Taaable system, a case-based reasoning system that adapts cooking recipes to user constraints. The AK comes from the interpretation of closed itemsets (CIs) whose items correspond to the ingredients that have to be removed, kept, or added. An original approach is proposed for building the context on which CI extraction is perfo...
متن کاملFrequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms that employ sophisticated in-memory data structures, where the data is stored into and retrieved from flat files. Most performance experiments have shown that SQL-based approaches are inferior to mainmemory algorithm...
متن کاملA Generalized Parallel Algorithm for Frequent Itemset Mining
A parallel algorithm for finding the frequent itemsets in a set of transactions is presented. The frequent individual items are identified by their index. We assume that processors number (m) is less than the frequent items number (n). At the first stage, every processor Pi, i ∈ {1, . . . ,m − 1} sequentially computes the frequent itemsets from the interval Ii = [(i − 1) · p + 1, i · p], where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2014
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2013.08.039